Random models of idempotent linear Maltsev conditions. I. Idemprimality

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deciding some Maltsev conditions in finite idempotent algebras

In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a certain type of existential condition on its set of term operations. These conditions, known as Maltsev conditions, have played a central role in the classification, study, and applications of general algebraic structures. Several well studied properties of equationally define...

متن کامل

Characterizations of Several Maltsev Conditions

Tame congruence theory identifies six Maltsev conditions associated with locally finite varieties omitting certain types of local behaviour. Extending a result of Siggers, we show that of these six Maltsev conditions only two of them are equivalent to strong Maltsev conditions for locally finite varieties. Besides omitting the unary type [24], the only other of these conditions that is strong i...

متن کامل

On the Complexity of Some Maltsev Conditions

This paper studies the complexity of determining if a finite algebra generates a variety that satisfies various Maltsev conditions, such as congruence distributivity or modularity. For idempotent algebras we show that there are polynomial time algorithms to test for these conditions but that in general these problems are EXPTIME complete. In addition, we provide sharp bounds in terms of the siz...

متن کامل

Idempotent Probability Measures, I

The set of all idempotent probability measures (Maslov measures) on a compact Hausdorff space endowed with the weak* topology determines is functorial on the category Comp of compact Hausdorff spaces. We prove that the obtained functor is normal in the sense of E. Shchepin. Also, this functor is the functorial part of a monad on Comp. We prove that the idempotent probability measure monad conta...

متن کامل

Laws of Large Numbers for Random Linear

The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebra universalis

سال: 2020

ISSN: 0002-5240,1420-8911

DOI: 10.1007/s00012-019-0636-y